package com.dianhun.es.other;

import java.util.Scanner;

/**
 * @author cyt
 * @create 2020-10-10 19:23
 */
public class ggg {

    public void test() {
        Scanner sc = new Scanner(System.in);
        while (sc.hasNext()) {
            int num = sc.nextInt();
            int result = 0;

            int[][] arr = new int[num + 1][];
            for (int i = 3; i <= num; i++) {
                int columnNum = (int) Math.floor((i - 1) / 2d);
                arr[i] = new int[columnNum];
                for (int j = 0; j < columnNum; j++) {
                    arr[i][j] = 1;
                    int num2 = j + 1;
                    int num1 = i - num2;
                    if (num1 > 2 * num2) {
                        if (num1 % 2 == 0) {
                            arr[i][j]++;
                        }
                        //计算数1的分解情况
                        for (int k = j; k < arr[num1].length; k++) {
                            arr[i][j] += arr[num1][k];
                        }

                    }
                }

            }
            if (num == 1 || num == 2) result = 0;
            else {
                for (int i = 0; i < arr[num].length; i++) {
                    result += arr[num][i];
                }
            }
            System.out.println(result);
        }
    }

    public static void main(String[] args) {
        char t;
        int i, j;
        Scanner sc = new Scanner(System.in);

        while (sc.hasNextLine()) {
            String next = sc.next();
            char[] array = next.toCharArray();
            for (int i1 = 0; i1 < next.length(); i1++) {
                j = i1;
                if ('a' <= array[i1] && array[i1] <= 'z') {
                    while (j != 0 && 'A' <= array[j - 1] && array[j - 1] <= 'Z') {
                        t = array[j - 1];
                        array[j - 1] = array[j];
                        array[j--] = t;
                    }
                }
            }
            for (char c : array) {
                System.out.print(c);
            }
        }
    }
}
